|
Skein relations are a mathematical tool used to study knots. A central question in the mathematical theory of knots is whether two knot diagrams represent the same knot. One way to answer the question is using knot polynomials, which are invariants of the knot. If two diagrams have different polynomials, they represent different knots. The reverse may not be true. Skein relations are often used to give a simple definition of knot polynomials. A skein relation gives a linear relation between the values of a knot polynomial on a collection of three links which differ from each other only in a small region. For some knot polynomials, such as the Conway, Alexander, and Jones polynomials, the relevant skein relations are sufficient to calculate the polynomial recursively. For others, such as the HOMFLYPT polynomial, more complicated algorithms are necessary. ==Definition== A skein relationship requires three link diagrams that are identical except at one crossing. The three diagrams must exhibit the three possibilities that could occur for the two line segments at that crossing, one of the lines could pass ''under,'' the same line could be ''over'' or the two line might not cross at all. Link diagrams must be considered because a single skein change can alter a diagram from representing a knot to one representing a link and vice versa. Depending on the knot polynomial in question, the links (or tangles) appearing in a skein relation may be oriented or unoriented. The three diagrams are labelled as follows. Turn the three link diagram so the directions at the crossing in question are both roughly northward. One diagram will have northwest over northeast, it is labelled ''L''−. Another will have northeast over northwest, it's ''L''+. The remaining diagram is lacking that crossing and is labelled ''L''0. :File:skein-relation-patches.png (The labelling is actually independent of direction insofar as it remains the same if all directions are reversed. Thus polynomials on undirected knots are unambiguously defined by this method. However, the directions on ''links'' are a vital detail to retain as one recurses through a polynomial calculation.) It is also sensible to think in a generative sense, by taking an existing link diagram and "patching" it to make the other two—just so long as the patches are applied with compatible directions. To recursively define a knot (link) polynomial, a function ''F'' is fixed and for any triple of diagrams and their polynomials labelled as above, : or more pedantically : for all (Finding an ''F'' which produces polynomials independent of the sequences of crossings used in a recursion is no trivial exercise.) More formally, a skein relation can be thought of as defining the kernel of a quotient map from the planar algebra of tangles. Such a map corresponds to a knot polynomial if all closed diagrams are taken to some (polynomial) multiple of the image of the empty diagram. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Skein relation」の詳細全文を読む スポンサード リンク
|
